Critical behavior in lossy source coding

نویسندگان

Amir Dembo

Ioannis Kontoyiannis

چکیده

The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O( √ n) or O(logn). We show it is always O( √ n), except for discrete, uniformly distributed sources. Keywords—Redundancy, rate-distortion theory, lossy data compression

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossy Coding of Sources with Mixed Distribution

In order to investigate the theoretical limits in lossy coding of sources with mixed distribution, the asymptotic behavior of the rate-distortion function of a source vector with mixed distribution is derived. The source distribution is a nite mixture of components such that under each component distribution a certain subset of the coordinates has a discrete distribution while the remaining coo...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES A statistical–mechanical view on source coding: physical compression and data compression

We draw a certain analogy between the classical information–theoretic problem of lossy data compression (source coding) of memoryless information sources and the statistical mechanical behavior of a certain model of a chain of connected particles (e.g., a polymer) that is subjected to a contracting force. The free energy difference pertaining to such a contraction turns out to be proportional t...

متن کامل

Lossless Source Coding Lecture Notes & Examples

variously referred to as source coding, lossless coding, noiseless coding or entropy coding exactly and without error, the original message. Lossless coding implies that the message may be decoded back to the original sequence of symbols. The converse of lossless coding (“lossy” coding) implies some degree of approximation of the original message. lossless coding may augment lossy coding, eg VQ...

متن کامل

Lossy data compression: nonasymptotic fundamental limits

The basic tradeoff in lossy compression is that between the compression ratio (rate) and the fidelity of reproduction of the object that is compressed. Traditional (asymptotic) information theory seeks to describe the optimum tradeoff between rate and fidelity achievable in the limit of infinite length of the source block to be compressed. A perennial question in information theory is how relev...

متن کامل